On Modal μ-Calculus over Finite Graphs with Bounded Strongly Connected Components
نویسندگان
چکیده
The subject of this paper is Modal μ-Calculus, an extension of Modal Logic with operators for least and greatest fixpoints of monotone functions on sets. This logic, introduced by Kozen in [17], is a powerful formalism capable of expressing inductive as well as coinductive concepts and beyond (e.g. safety, liveness, fairness, termination, etc.) and is widely used in the area of verification of computer systems, be them hardware or software, see [5].
منابع مشابه
The μ-calculus alternation hierarchy collapses over structures with restricted connectivity
It is known that the alternation hierarchy of least and greatest fixpoint operators in the μ-calculus is strict. However, the strictness of the alternation hierarchy does not necessarily carry over when considering restricted classes of structures. A prominent instance is the class of infinite words over which the alternation-free fragment is already as expressive as the full μ-calculus. Our cu...
متن کاملThe \mu-Calculus Alternation Hierarchy Collapses over Structures with Restricted Connectivity
It is known that the alternation hierarchy of least and greatest fixpoint operators in the μ-calculus is strict. However, the strictness of the alternation hierarchy does not necessarily carry over when considering restricted classes of structures. A prominent instance is the class of infinite words over which the alternation-free fragment is already as expressive as the full μ-calculus. Our cu...
متن کاملThe Descriptive Complexity of Parity Games
We study the logical definablity of the winning regions of parity games. For games with a bounded number of priorities, it is wellknown that the winning regions are definable in the modal μ-calculus. Here we investigate the case of an unbounded number of priorities, both for finite game graphs and for arbitrary ones. In the general case, winning regions are definable in guarded second-order log...
متن کاملBounded game-theoretic semantics for modal mu-calculus
We introduce a new game-theoretic semantics (GTS) for the modal μ-calculus. Our so-called bounded GTS replaces parity games with novel alternative evaluation games where only finite paths arise. Infinite paths are not needed even when the considered transition system is infinite.
متن کاملParity games, separations, and the modal μ-calculus
The topics of this thesis are the modal μ-calculus and parity games. The modal μ-calculus is a common logic for model-checking in computer science. The modelchecking problem of the modal μ-calculus is polynomial time equivalent to solving parity games, a 2-player game on labeled directed graphs. We present the first FPT algorithms (fixed-parameter tractable) for the model-checking problem of th...
متن کامل